7 research outputs found
Cayley-Dickson Algebras and Finite Geometry
Given a -dimensional Cayley-Dickson algebra, where , we
first observe that the multiplication table of its imaginary units , , is encoded in the properties of the projective space
PG if one regards these imaginary units as points and distinguished
triads of them , and , as lines. This projective space is seen to feature two distinct kinds
of lines according as or . Consequently, it also exhibits
(at least two) different types of points in dependence on how many lines of
either kind pass through each of them. In order to account for such partition
of the PG, the concept of Veldkamp space of a finite point-line
incidence structure is employed. The corresponding point-line incidence
structure is found to be a binomial -configuration ; in particular,
(octonions) is isomorphic to the Pasch -configuration,
(sedenions) is the famous Desargues -configuration,
(32-nions) coincides with the Cayley-Salmon -configuration found
in the well-known Pascal mystic hexagram and (64-nions) is
identical with a particular -configuration that can be viewed as
four triangles in perspective from a line where the points of perspectivity of
six pairs of them form a Pasch configuration. We also draw attention to a
remarkable nesting pattern formed by these configurations, where occurs as a geometric hyperplane of . Finally, a brief
examination of the structure of generic leads to a conjecture that
is isomorphic to a combinatorial Grassmannian of type .Comment: 26 pages, 20 figures; V2 - the basis made explicit, a footnote and a
couple of references adde
Distinguished three-qubit 'magicity' via automorphisms of the split Cayley hexagon
Disregarding the identity, the remaining 63 elements of the generalized
three-qubit Pauli group are found to contain 12096 distinct copies of Mermin's
magic pentagram. Remarkably, 12096 is also the number of automorphisms of the
smallest split Cayley hexagon. We give a few solid arguments showing that this
may not be a mere coincidence. These arguments are mainly tied to the structure
of certain types of geometric hyperplanes of the hexagon. It is further
demonstrated that also an (18_{2}, 12_{3})-type of magic configurations,
recently proposed by Waegell and Aravind (J. Phys. A: Math. Theor. 45 (2012)
405301), seems to be intricately linked with automorphisms of the hexagon.
Finally, the entanglement properties exhibited by edges of both pentagrams and
these particular Waegell-Aravind configurations are addressed.Comment: 15 pages, 4 figures, 5 table
Veldkamp-Space Aspects of a Sequence of Nested Binary Segre Varieties
Let be a Segre variety that is -fold direct product of projective
lines of size three. Given two geometric hyperplanes and of
, let us call the triple the
Veldkamp line of . We shall demonstrate, for the sequence , that the properties of geometric hyperplanes of are fully
encoded in the properties of Veldkamp {\it lines} of . Using this
property, a complete classification of all types of geometric hyperplanes of
is provided. Employing the fact that, for , the
(ordinary part of) Veldkamp space of is , we shall
further describe which types of geometric hyperplanes of lie on a
certain hyperbolic quadric that
contains the and is invariant under its stabilizer group; in the
case we shall also single out those of them that correspond, via the
Lagrangian Grassmannian of type , to the set of 2295 maximal subspaces
of the symplectic polar space .Comment: 16 pages, 8 figures and 7 table
Jordan Decompositions of Tensors
We expand on an idea of Vinberg to take a tensor space and the natural Lie algebra which acts on it and embed them into an auxiliary algebra. Viewed as endomorphisms of this algebra we associate adjoint operators to tensors. We show that the group actions on the tensor space and on the adjoint operators are consistent, which endows the tensor with a Jordan decomposition. We utilize aspects of the Jordan decomposition to study orbit separation and classification in examples that are relevant for quantum information
Robust digital optimal control on IBM quantum computers
The ability of pulse-shaping devices to generate accurately quantum optimal control is a strong limitation to the development of quantum technologies. We propose and demonstrate a systematic procedure to design robust digital control processes adapted to such experimental constraints. We show to what extent this digital pulse can be obtained from its continuous-time counterpart. A remarkable efficiency can be achieved even for a limited number of pulse parameters. We experimentally implement the protocols on IBM quantum computers for a single qubit, obtaining an optimal robust transfer in a time T = 382 ns